Minimum Distance Violation Tree Problems
نویسنده
چکیده
منابع مشابه
Some tractable instances of interval data minmax regret problems: bounded distance from triviality (short version)
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particular instances of the interval data minmax regret versions of the shortest path, minimum spanning tree and weighted (bipartite) perfect matching problems. These sets are defined using a parameter that measures the distan...
متن کاملSome Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particular instances of the interval data minmax regret versions of the shortest path, minimum spanning tree and weighted (bipartite) perfect matching problems. These sets are defined using a parameter that measures the distan...
متن کاملA Generalized Distance in Graphs and Centered Partitions
This paper is concerned with a new distance in undirected graphs with weighted edges, which gives new insights into the structure of all minimum spanning trees of a graph. This distance is a generalized one, in the sense that it takes values in a certain Heyting semigroup. More precisely, it associates with each pair of distinct vertices in a connected component of a graph the set of all paths ...
متن کاملOn some network design problems with degree constraints
We study several network design problems with degree constraints. For the minimum-cost Degree-Constrained 2-Node-Connected Subgraph problem, we obtain the first non-trivial bicriteria approximation algorithm, with factor 6 violation for the degrees and a 4-approximation for the cost. This improves upon the logarithmic degree violation and no cost guarantee obtained by Feder, Motwani, and Zhu (2...
متن کاملWhen Crossings Count — Approximating the Minimum
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings between the spanning tree and the lines. The expected running time of the algorithm is near linear. We also show how to embed such a crossing metric of hyperplanes in d-dimensions, in subquadratic time, into high-dimensions s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007